#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
using namespace std;
#define bug printf("BUG\n")
const int N=1e5+50;
const int M=1e6+50;
const int INF=0x3f3f3f3f;
double x[N],y[N];
int n;
int cnt;
int head[N];
double d;
struct Edge{
    int v;
    double w;
    int next;
}edge[M];
void init(){
    cnt=0;
    memset(head,-1,sizeof(head));
}
void addEdge(int u,int v,double w){
    edge[cnt]=Edge{v,w,head[u]};
    head[u]=cnt++;
}
double dis[N];
bool vis[N];
struct node{
    int v;
    double c;
    bool operator < (const node& r) const{
        return c>r.c;
    }
};
void Dijkstra(){
    for(int i=0;i<n;i++){
        dis[i]=INF;
        vis[i]=false;
    }
    dis[0]=0.0;
    priority_queue<node> q;
    q.push(node{0,0});
    node tmp;
    while(!q.empty()){
        tmp=q.top();
        q.pop();
        int u=tmp.v;
        if(vis[u]){
            continue;
        }
        vis[u]=true;
        for(int i=head[u];i!=-1;i=edge[i].next){
            int v=edge[i].v;
            double w=edge[i].w;
            dis[v]=min(dis[v],max(w,dis[u]));
            q.push(node{v,dis[v]});
        }
    }
}
int main(void){
    int c=1;
    while(~scanf("%d",&n) && n){
        for(int i=0;i<n;i++){
            scanf("%lf%lf",&x[i],&y[i]);
        }
        init();
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
                addEdge(i,j,d);
            }
        }
        Dijkstra();
        printf("Scenario #%d\nFrog Distance = %.3f\n\n",c++,dis[1]);
    }
    return 0;
}